Waiter–Client and Client–Waiter Hamiltonicity games on random graphs
نویسندگان
چکیده
منابع مشابه
Waiter-Client and Client-Waiter Hamiltonicity games on random graphs
We study two types of two player, perfect information games with no chance moves, played on the edge set of the binomial random graph G(n, p). In each round of the (1 : q) Waiter-Client Hamiltonicity game, the first player, called Waiter, offers the second player, called Client, q + 1 edges of G(n, p) which have not been offered previously. Client then chooses one of these edges, which he claim...
متن کاملLong paths and Hamiltonicity in random graphs
We discuss several classical results about long paths and Hamilton cycles in random graphs and present accessible versions of their proofs, relying on the Depth First Search (DFS) algorithm and the notion of boosters.
متن کاملRobust Hamiltonicity of random directed graphs
In his seminal paper from 1952 Dirac showed that the complete graph on n ≥ 3 vertices remains Hamiltonian even if we allow an adversary to remove bn/2c edges touching each vertex. In 1960 Ghouila-Houri obtained an analogue statement for digraphs by showing that every directed graph on n ≥ 3 vertices with minimum inand out-degree at least n/2 contains a directed Hamilton cycle. Both statements q...
متن کاملLocal Resilience and Hamiltonicity Maker-Breaker Games in Random Regular Graphs
For an increasing monotone graph property P the local resilience of a graph G with respect to P is the minimal r for which there exists a subgraph H ⊆ G with all degrees at most r, such that the removal of the edges of H from G creates a graph that does not possess P . This notion, which was implicitly studied for some ad hoc properties, was recently treated in a more systematic way in a paper ...
متن کاملPositional games on random graphs
We introduce and study Maker/Breaker-type positional games on random graphs. Our main concern is to determine the threshold probability pF for the existence of Maker’s strategy to claim a member of F in the unbiased game played on the edges of random graph G(n, p), for various target families F of winning sets. More generally, for each probability above this threshold we study the smallest bias...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2017
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2017.02.002